منابع مشابه
Domain-Specific Languages for a Changing World
Domain-specific languages (DSLs) provide an excellent means to create applications in a particular domain in a highly efficient manner. It reduces code size, increases reusability and allows non-software engineers to construct software systems using their domain knowledge. However, design of a DSL requires a solid understanding of the domain for which the DSL is constructed. In this paper, we s...
متن کاملLearning Languages from Examples
In this project I explore the machine learning problem of learning formal languages from positive and negative examples. I describe a technique proposed by Kontorovich, Cortes, and Mohri in their paper titled “Learning Linearly Separable Languages.” The premise of this paper is that there exists a family of languages that are linearly separable and efficiently computable under a certain computa...
متن کاملLearning of Partial Languages
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local partial languages, regular partial languages and partial line languages. We present an algorithm for learning local partial languages in the limit from positive data. The time taken for the algorithm to identify the regular...
متن کاملLearning Linearly Separable Languages
For a finite alphabet A, we define a class of embeddings of A∗ into an infinite-dimensional feature space X and show that its finitely supported hyperplanes define regular languages. This suggests a general strategy for learning regular languages from positive and negative examples. We apply this strategy to the piecewise testable languages, presenting an embedding under which these are precise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: English Today
سال: 2004
ISSN: 0266-0784,1474-0567
DOI: 10.1017/s0266078404004018